Implementation of CAVENET and its usage for performance evaluation of AODV, OLSR and DYMO protocols in vehicular networks

Vehicle Ad-hoc Network (VANET) is a kind of Mobile Ad-hoc Network (MANET) that establishes wireless connection between cars. In VANETs and MANETs, the topology of the network changes very often, therefore implementation of efficient routing protocols is very important problem. In MANETs, the Random Waypoint (RW) model is used as a simulation model for generating node mobility pattern. On the other hand, in VANETs, the mobility patterns of nodes is restricted along the roads, and is affected by the movement of neighbour nodes. In this paper, we present a simulation system for VANET called CAVENET (Cellular Automaton based VEhicular NETwork). In CAVENET, the mobility patterns of nodes are generated by an 1-dimensional cellular automata. We improved CAVENET and implemented some routing protocols. We investigated the performance of the implemented routing protocols by CAVENET. The simulation results have shown that DYMO protocol has better performance than AODV and OLSR protocols.Peer ReviewedPostprint (published version

A study on the performance of Oracle Grid Engine for computing intensive applications

(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Computing intensive applications are an important family of applications in distributed computing domain. They have been object of study using different distributed computing paradigms and infrastructures. Such applications distinguish for their demanding needs for CPU computing, independently of the amount of data associated with the problem instance. Among computing intensive applications, there are applications based on simulations, aiming to maximize system resources for processing large computations for simulation. In this paper, we consider an application that simulates scheduling and resource allocation in a Grid computing system using Genetic Algorithms. In such application, a rather large number of simulations is needed to extract meaningful statistical results about the behaviour of the simulation results. We study the performance of Oracle Grid Engine for such application running in a Cluster of high computing capacities. Several scenarios were generated to measure the response time and queuing time under different workloads and number of nodes in the cluster.Peer ReviewedPostprint (author's final draft

Performance analysis of WMNs by WMN-GA simulation system for exponential distribution considering EDCA and DCF

(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.In this paper, we evaluate the performance of WMN using our WMN-GA simulation system considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3 and Optimized Link State Routing (OLSR). We compare the performance of Distributed Coordination Function (DCF) and Enhanced Distributed Channel Access (EDCA) for exponential distribution of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for Hybrid WMN, the throughput of both MAC protocols is higher than I/B WMN. The delay and jitter of Hybrid WMN are lower than I/B WMN. The fairness index of I/B WMN is a little bit higher than Hybrid WMN.Peer ReviewedPostprint (author's final draft

Application of JXTA-overlay platform for secure robot control

In this paper, we present the evaluation and experimental results of secured robot control in a P2P system. The control system is based on JXTA-Overlay platform. We used secure primitives and functions of JXTA-Overlay for the secure control of the robot motors. We investigated the time of robot control for some scenarios with different number of peers connected in JXTA-Overlay network. All experiments are realised in a LAN environment. The experimental results show that with the join of other peers in the network, the average time of robot control is increased, but the difference between the secure and unsecure robot control average time is nearly the samePeer ReviewedPostprint (published version

Scalability, memory issues and challenges in mining large data sets

(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Data mining is an active field of research and development aiming to automatically extract "knowledge" from analyzing data sets. Knowledge can be defined in different ways such as discovering (structured, frequent, approximate, etc.) patterns in data, grouping/clustering/bi-clustering data according to one or more criteria, finding association rules, etc. Such knowledge is then fed-back to decision support systems enabling end-users (actors) to make more informed decisions, which in economic terms could lead to advantages as compared to traditional decision support systems. It should be noted however, that data mining algorithms and frameworks have been proposed prior to the "Big Data" explosion. While data mining algorithms have considered efficiency and computational complexity as an important requirement, they did not take into account features of Big Data such as very large size, velocity with which data is generated, variety, etc. On the other hand, these features are indeed posing issues and challenges to data mining algorithms and frameworks. In this paper we analyse some of the issues in mining large data sets such as scalability and in-memory needs. We also show some computational results pointing out to such issues.Peer ReviewedPostprint (author's final draft

Hybrid algorithms for independent batch scheduling in grids

Grid computing has emerged as a wide area distributed paradigm for solving large-scale problems in science, engineering, etc. and is known as the family of eScience grid-enabled applications. Computing planning of incoming jobs efficiently with available machines in the grid system is the main requirement for optimised system performance. One version of the problem is that of independent batch scheduling, in which jobs are assumed to be independent and are scheduled in batches aimed at minimising the makespan and flowtime. Given the hardness of the problem, heuristics are used to find high quality solutions for practical purposes of designing efficient grid schedulers. Recently, considerable efforts were spent in implementing and evaluating not only stand-alone heuristics and meta-heuristics, but also their hybridisation into even higher level algorithms. In this paper, we present a study on the performance of two popular algorithms for the problem, namely Genetic Algorithms (GAs) and Tabu Search (TS) and two hybridisations involving them, namely, the GA (TS) and GA-TS, which differ in the way the main control and cooperation among GA and TS are implemented. The hierarchic and simultaneous optimisation modes are considered for the bi-objective scheduling problem. Evaluation is done using different grid scenarios generated by a grid simulator. The computational results showed that the hybrid algorithm outperforms both the GA and TS for the makespan parameter, but not for the flowtime parameter.Peer ReviewedPostprint (author's final draft

Implementation of an e-learning system using P2P, web and sensor technologies

This work is motivated by the need to develop decentralized P2P approaches to support learning and teaching activity in virtual universities. In this paper, we present the implementation of the JXTA-based e-learning P2P system. We also show the design and implementation of a SmartBox environment that will be used for stimulating the learners to increase the learning efficiency. The proposed e-learning P2P system is a useful tool for monitoring and controlling learnerspsila activity. We evaluate the proposed system by experimental results and show that proposed system has a good performance. In the future, we aim to use it in real virtual campus environments.Peer ReviewedPostprint (published version

Stimulation effects of SmartBox for e-learning using JXTA-overlay P2P system

This work is motivated by the need to develop decentralized P2P approaches to support learning and teaching activity in virtual universities.In this paper, we present the stimulation effects of the SmartBox for e-learning using JXTA-overlay P2P system. We also show the design and implementation of the SmartBox environment that is used for stimulating the learners motivation to increase the learning efficiency. The SmartBox is integrated with our P2P system as a useful tool for monitoring and controlling learners' activity. We found by experimental results thatthe SmartBox is an effective way to increase the learner's concentration. We also investigated the relation between learner's body movement, concentration, and amount of study. We found that when the learner is solving more exerciseshe has more body movements.This shows that when the number of body movements is hight,the learner's concentration is high. We also consider the feasibility of our P2P platform to integrate different computational end-devices.Peer ReviewedPostprint (published version

Performance analysis of different architectures and TCP congestion-avoidance algorithms using WMN-GA simulation system

In this paper, we evaluate the performance of two Wireless Mesh Networks (WMNs) architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3, Distributed Coordination Function (DCF) and Optimized Link State Routing (OLSR). We compare the performance of WMN for different Transmission Control Protocol (TCP): Tahoe, Reno and NewReno considering normal and uniform distributions of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for normal and uniform distributions and both WMN architectures, the PDR values are almost the same. For Hybrid WMN, the throughput of TCP NewReno is good, but for I/B WMN, the throughput of TCP Tahoe is higher than other algorithms. For normal distribution, the delay and jitter of I/B WMN are lower compared with Hybrid WMN, while for uniform distribution, the delay and jitter of TCP NewReno are a little bit lower compared with other algorithms. The fairness index of normal distribution is higher than uniform distribution.Peer ReviewedPostprint (author's final draft

An adaptive event-based system for anytime, anywhere, awareness services in online teamworks

The fast development in mobile technologies is drastically changing the way people work, learn, collaborate and socialise. One such important activity that has emerged and is being consolidated more each time is the online learning through virtual campuses. While most of online learning services are at present offered through web-based platforms, due to ever-increasing use of smart devices such as smartphones and tablets, researchers and developers are paying attention to exploit the advantages of mobile systems to support online learning. Specifically, the implementation of the A3 paradigm: anytime, anywhere, awareness - that is, notifying users about ongoing activity in their online workspace - provides various advantages to online learners organised in online teams. In this paper, we present the requirement analysis, the building blocks of the architecture for efficient event-based system and a prototype implementation of the A3 paradigm that adaptively supports the online collaborative activity.Peer ReviewedPostprint (author's final draft